Publication venue
Publication date 01/01/2013
Field of study Full text link We study the problem of augmenting a weighted graph by inserting edges of
bounded total cost while minimizing the diameter of the augmented graph. Our
main result is an FPT 4-approximation algorithm for the problem.Comment: 15 pages, 3 figure
Publication venue Unknown Publisher
Publication date 01/01/1987
Field of study No full text
Publication venue Unknown Publisher
Publication date 01/01/1991
Field of study No full text
Publication venue Unknown Publisher
Publication date 01/01/1992
Field of study No full text
Publication venue Unknown Publisher
Publication date 01/01/1987
Field of study No full text
Publication venue Unknown Publisher
Publication date 01/01/1990
Field of study No full text
Publication venue Unknown Publisher
Publication date 01/01/1988
Field of study No full text
Publication venue Unknown Publisher
Publication date 01/01/1988
Field of study No full text
Publication venue Unknown Publisher
Publication date 01/01/1988
Field of study No full text
Publication venue Unknown Publisher
Publication date 01/01/1993
Field of study No full text